package com.xjl.everyinterview.datastructureandalgorithm.datastructure.binarytree;

/**
 * @author xjl
 * @version 1.0
 * @description: 构建一个数据结构
 * @date 2021/8/16 18:21
 */
public class TreeNode {
    
    int data;

    TreeNode leftNode;

    TreeNode rightNode;

    public TreeNode(int data) {
        this.data = data;
    }

    public int getData() {
        return data;
    }

    public void setData(int data) {
        this.data = data;
    }

    public TreeNode getLeftNode() {
        return leftNode;
    }

    public void setLeftNode(TreeNode leftNode) {
        this.leftNode = leftNode;
    }

    public TreeNode getRightNode() {
        return rightNode;
    }

    public void setRightNode(TreeNode rightNode) {
        this.rightNode = rightNode;
    }
}
